A Concrete Security Treatment of Symmetric Encryption
نویسندگان
چکیده
We study notions of security and schemes for symmetric (ie. private key) encryption in a concrete security framework. We give several di erent notions of security and analyze the concrete complexity of reductions among them. Next we provide concrete security analyses of various methods of encrypting using a block cipher, including two of the most popular methods, Cipher Block Chaining and Counter Mode. We establish tight bounds (meaning matching upper bounds and attacks) on the success of adversaries as a function of their resources. Dept. of Computer Science & Engineering, University of California at San Diego, 9500 Gilman Drive, La Jolla, CA 92093, USA. E-Mail: fmihir; adesai; [email protected]. URL: http://www-cse.ucsd.edu/users/ fmihir; adesai; ejg. Supported in part by NSF CAREER Award CCR-9624439 and a 1996 Packard Foundation Fellowship in Science and Engineering. yDept. of Computer Science, Engineering II Bldg., University of California at Davis, Davis, CA 95616, USA. E-mail: [email protected]. URL: http://wwwcsif.cs.ucdavis.edu/~rogaway. Supported in part by NSF CAREER Award CCR-9624560.
منابع مشابه
A Concrete Security Treatment of Symmetric Encryption: Analysis of the DES Modes of Operation
We study notions and schemes for symmetric (ie. private key) encryption in a concrete security framework. We give four di erent notions of security against chosen plaintext attack and analyze the concrete complexity of reductions among them, providing both upper and lower bounds, and obtaining tight relations. In this way we classify notions (even though polynomially reducible to each other) as...
متن کاملConcrete Security Against Adversaries with Quantum Superposition Access to Encryption and Decryption Oracles
In 2013, Boneh and Zhandry introduced the notion of indistinguishability (IND) in chosen plaintext (CPA) and chosen ciphertext (CCA) attacks by a quantum adversary which is given superposition access to an oracle for encryption and decryption queries but is restricted to classical queries in the challenge phase. In this paper we define INDCPA and IND-CCA notions for symmetric encryption schemes...
متن کاملWhite-Box Security Notions for Symmetric Encryption Schemes
White-box cryptography has attracted a growing interest from researchers in the last decade. Several white-box implementations of standard block-ciphers (DES, AES) have been proposed but they have all been broken. On the other hand, neither evidence of existence nor proofs of impossibility have been provided for this particular setting. This might be in part because it is still quite unclear wh...
متن کاملExpanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security
We present a new encryption mode for block ciphers. The mode is efficient and is secure against chosen-plaintext attack (CPA) already if the underlying symmetric cipher is secure against known-plaintext attack (KPA). We prove that known (and widely used) encryption modes as CBC mode and counter mode do not have this property. In particular, we prove that CBC mode using a KPA secure cipher is KP...
متن کاملBrowse searchable encryption schemes: Classification, methods and recent developments
With the advent of cloud computing, data owners tend to submit their data to cloud servers and allow users to access data when needed. However, outsourcing sensitive data will lead to privacy issues. Encrypting data before outsourcing solves privacy issues, but in this case, we will lose the ability to search the data. Searchable encryption (SE) schemes have been proposed to achieve this featur...
متن کامل